TPS: An Interactive and Automatic Tool for Proving Theorems of Type Theory

نویسندگان

  • Peter B. Andrews
  • Matthew Bishop
  • Sunil Issar
  • Daniel Nesmith
  • Frank Pfenning
  • Hongwei Xi
چکیده

This is a demonstration of TPS, a theorem proving system for classical type theory (Church’s typed λ-calculus). TPS can be used interactively or automatically, or in a combination of these modes. An important feature of TPS is the ability to translate between expansion proofs and natural deduction proofs. CATEGORY: Demonstration

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proving Theorems of Type Theory Automatically with TPS

Reasoning plays an important role in many activities which involve intelligence, and it may be anticipated that automated reasoning will play a significant role in many applications of artificial intelligence. The importance of developing methods of automating reasoning has been recognized since the inception of research on artificial intelligence. One fruitful approach to this problem is to us...

متن کامل

Groups and Ultra-groups

In this paper, in addition to some elementary facts about the ultra-groups, which their structure based on the properties of the transversal of a subgroup of a group, we focus on the relation between a group and an ultra-group. It is verified that every group is an ultra-group, but the converse is not true generally. We present the conditions under which, for every normal subultra-group of an u...

متن کامل

First Order Logic in Practice

There is a trend away from monolithic automated theorem provers towards using automation as a tool in support of interactive proof. We believe this is a fruitful drawing together of threads in automated reasoning. But it raises a number of issues that are often neglected in the classical rst order theorem proving literature such as the following. Is rst order automation actually useful, and if ...

متن کامل

Integrating Tps and Omega

This paper reports on the integration of the higher-order theorem proving environment Tps [Andrews et al., 1996] into the mathematical assistant mega [Benzm uller et al., 1997]. Tps can be called from mega either as a black box or as an interactive system. In black box mode, the user has control over the parameters which control proof search inTps; in interactive mode, all features of theTps-s...

متن کامل

Automatic verification and interactive theorem proving

Sommario. Automatic verification deals with the validation by means of computers of correctness certificates. The related tools, usually called proof assistant or interactive provers, provide an interactive environment for the creation of formal certificates whose correctness can be assessed in a purely automatic way. Such systems have applications both in mathematics, where certificates are pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993